Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
نویسندگان
چکیده
This paper considers the problem of electing a leader ina dynamic ring in which processors are permitted to fail and recoverduring election. e( n log n + I;, ) messages, when counting only messagessent by functional processors, are shown to be necessary and sufficientfor dynamic ring election, where I;v is the number of processor recoveriesexperienced.
منابع مشابه
Multipath E-Cube Algorithms (MECA) for Adaptive Wormhole Routing and Broadcasting in itk-ary itn-Cubes
This paper introduces and evaluates the Multipath E-Cube Algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able t...
متن کاملHierarchical adaptive routing: a framework for fully adaptive and deadlock-free wormhole routing
Adaptive routing can improve network performance and fault-tolerance by providing multiple routing paths. However, the implementation complexity of adaptive routing can be signiicant, discouraging its use in commercial massively parallel systems. In this paper, we introduce Hierarchical Adaptive Routing (HAR), a new adaptive routing framework, which provides a uni-ed framework for simple and hi...
متن کاملAn Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes
The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free rou...
متن کاملMultipath E-cube Algorithms (meca) for Adaptive Wormhole Routing and Broadcasting in K-ary N-cubes
This paper introduces and evaluates the Multipath E-Cube Algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able t...
متن کاملMinimal turn restrictions for designing deadlock-free adaptive routing
A routing algorithm is basically required to be connected and deadlock-fee. We can restrict some directions that messages can turn in a network to avoid deadlock. A deadlock-pee adaptive routing with fewer turn restrictions is considered to possess a greater degree of adaptiveness. We present two basic strategies for designing feasible routings on networks which have bidirectional channels. Pri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Parallel Distrib. Syst.
دوره 4 شماره
صفحات -
تاریخ انتشار 1993